In this paper, we have punctured unit Zq-Simplex code and constructed a new code called unit Zq-Simplex code of type _. In particular, we find the parameters of these Codes and have proved that it is an [Φ, (q) + 2, 2, Φ, (q) + 2-Φ, (q) / Φ, (p)] Zq-linear code if k = 2 and [Φ, (q)k-1/ Φ, (q)-1 + Φ, (q)k-2, k, Φ, (q)k-1/ Φ, (q)-1 + Φ, (q)k-2 –,(Φ, (q) / Φ, (p)) (Φ, (q)k-1 –,1/ Φ, (q)-1 + Φ, (q)k-3)] Zq-linear code if k ≥,3,where p is the smallest prime divisor of q: For q is a prime power and rank k = 3,we have given the weight distribution of unit Zq-Simplex Codes of type α, . Also, we have introduced some new code from Zq-Simplex code called zero divisor Zq-Simplex code and proved that it is an [ρ, k-1/ ρ,-1, k, ρ, k-1/ ρ,-1 –,(ρ, (k-1) –,1/ ρ,-1) (q/p)] Zq-linear code, where ρ,= q-Φ,(q) and p is the smallest prime divisor of q: Further, we obtain weight distribution of zero divisor Zq-Simplex code for rank k = 3 and q is a prime power.

In this article, we use group action theory to define some important ternary linear Codes. Some of these Codes are self-orthogonal having a minimum distance achieving the lower bound in the previous records. Then, we define two new Codes sharing the same automorphism group isomorphic to $C_2 \times M_{11}$ where $M_{11}$ is the Sporadic Mathieu group and $C_{2}$ is a cyclic group of two elements. We also study the natural action of the general linear group $GL (k, 2) $ on the vector space $F_2 ^ k$ to characterize Hamming Codes $H_k (2) $ and their automorphism group.

In this paper, lower bound and upper bound on the covering radius ofDNA Codes over a finite ring N with respect to Chinese euclidean distanceare given. Also determine the covering radius of various Repetition DNACodes, Simplex DNA code Type α and Simplex DNA code Type β andbounds on the covering radius for MacDonald DNA Codes of both typesover N.

In this paper, we  discuss the structure of polycyclic Codes over the ring $R=\mathbb{F}_q+u\mathbb{F}_q+v\mathbb{F}_q;u^2=\alpha u,v^2=v$ and $uv=vu=0$, where $\alpha$ is an unit element in $R.$ We introduce annihilator self-dual Codes, annihilator self-orthogonal Codes and annihilator LCD Codes over R. Using a Gray map, we define a one to one correspondence between $R$ and $\mathbb{F}_q$ and  construct quasi polycyclic  Codes over the  $\mathbb{F}_q$.

Background: Ethics is considered in detail in medicine, and it is needed to be respected carefully in psychology and psychotherapy. Ethics code provides a common set of principles and standards upon which psychologists build their professional and scientific work. This ethics code is intended to provide specific standards to cover most situations encountered by psychologists. This study aims to consider general principles and specific ethical issues in psychotherapy and consulting. Conclusion: General principles that should be respected by all psychologist and therapist are as followed; beneficence and nonmaleficence, fidelity and responsibility, integrity, justice, respect for people’ s right and dignity. Specific ethical issues in psychotherapy; informed consent in therapy, privacy and confidentiality, avoiding harm, unfair discrimination, sexual harassment.

Let Zp Zp be the finite field of integers modulo p p , where p>3 p>3 is a prime integer. This paper presents new constructions of linear Codes over Zp Zp . Based on our construction, linear Codes of length p− 1 p− 1 , including a wide family of MDS Codes, and Codes of length (p− 1)2 (p− 1)2 are constructed. we shall discuss the parameters of the Codes defined while describing a generator matrix for the first family.